www.gusucode.com > C++ Primer 书籍源代码源码程序 > C++ Primer 书籍源代码源码程序/code/15/main2.cpp
//Download by http://www.NewXing.com /* * This file contains code from "C++ Primer, Fourth Edition", by Stanley B. * Lippman, Jose Lajoie, and Barbara E. Moo, and is covered under the * copyright and warranty notices given in that book: * * "Copyright (c) 2005 by Objectwrite, Inc., Jose Lajoie, and Barbara E. Moo." * * * "The authors and publisher have taken care in the preparation of this book, * but make no expressed or implied warranty of any kind and assume no * responsibility for errors or omissions. No liability is assumed for * incidental or consequential damages in connection with or arising out of the * use of the information or programs contained herein." * * Permission is granted for this code to be used for educational purposes in * association with the book, given proper citation if and when posted or * reproduced.Any commercial use of this code requires the explicit written * permission of the publisher, Addison-Wesley Professional, a division of * Pearson Education, Inc. Send your request for permission, stating clearly * what code you would like to use, and in what specific way, to the following * address: * * Pearson Education, Inc. * Rights and Contracts Department * 75 Arlington Street, Suite 300 * Boston, MA 02216 * Fax: (617) 848-7047 */ #include "Query.h" #include "TextQuery.h" #include <string> #include <vector> #include <set> #include <iostream> using std::set; using std::string; using std::cout; using std::endl; int main(int, char **argv) { // get a file to read and builds map to support queries TextQuery file = build_textfile(argv[1]); // iterate with the user: prompt for a word to find and print results do { string sought; if (!get_word(sought)) break; // find all the occurrences of the requested string Query name(sought); Query notq = ~name; const set<TextQuery::line_no> locs = notq.eval(file); cout << "\nExecuted Query for: " << notq << endl; // report no matches print_results(locs, file); } while (true); // loop indefinitely; the exit is inside the loop return 0; }